Regular graph

Results: 157



#Item
51MOUNT VERNON SCHOOLS MIDDLE SCHOOL SUPPLY LISTS 8th Grade 1 Pack Post-it notes (2

MOUNT VERNON SCHOOLS MIDDLE SCHOOL SUPPLY LISTS 8th Grade 1 Pack Post-it notes (2"x2" or similar small size) 2 Regular composition notebooks (wide or college ruled) 2 Graph ruled composition notebooks Scientific calculat

Add to Reading List

Source URL: www.mountvernon.k12.ia.us

Language: English - Date: 2014-12-15 15:14:49
    52Querying Regular Graph Patterns ´ , Universidad de Chile PABLO BARCELO LEONID LIBKIN, University of Edinburgh JUAN L. REUTTER, University of Edinburgh and Pontificia Universidad Cat´olica de Chile

    Querying Regular Graph Patterns ´ , Universidad de Chile PABLO BARCELO LEONID LIBKIN, University of Edinburgh JUAN L. REUTTER, University of Edinburgh and Pontificia Universidad Cat´olica de Chile

    Add to Reading List

    Source URL: web.ing.puc.cl

    Language: English - Date: 2014-04-22 15:08:07
      53Regular Expressions with Binding over Data Words for Querying Graph Databases Leonid Libkin1 , Tony Tan2 , and Domagoj Vrgoˇc3 1  2

      Regular Expressions with Binding over Data Words for Querying Graph Databases Leonid Libkin1 , Tony Tan2 , and Domagoj Vrgoˇc3 1 2

      Add to Reading List

      Source URL: alpha.uhasselt.be

      Language: English - Date: 2013-09-27 07:35:34
      54Some Research Challenges and Remarks on CP Nicolas Beldiceanu Automata and Learning Question Is there a declarative way for describing concisely a generator of automata (or MDDs) that have a very regular structure?

      Some Research Challenges and Remarks on CP Nicolas Beldiceanu Automata and Learning Question Is there a declarative way for describing concisely a generator of automata (or MDDs) that have a very regular structure?

      Add to Reading List

      Source URL: 4c.ucc.ie

      Language: English - Date: 2012-10-12 20:10:27
      55Spin models, Random graphs, and Semidefinite relaxations Andrea Montanari Stanford University  May 15, 2015

      Spin models, Random graphs, and Semidefinite relaxations Andrea Montanari Stanford University May 15, 2015

      Add to Reading List

      Source URL: pages.iu.edu

      Language: English - Date: 2015-05-18 21:41:42
      56Integrality Gaps for Sherali–Adams Relaxations Moses Charikar∗ Princeton University Konstantin Makarychev IBM T.J. Watson Research Center

      Integrality Gaps for Sherali–Adams Relaxations Moses Charikar∗ Princeton University Konstantin Makarychev IBM T.J. Watson Research Center

      Add to Reading List

      Source URL: konstantin.makarychev.net

      Language: English - Date: 2014-06-08 22:16:40
      57Remarks on bootstrap percolation in metric networks

      Remarks on bootstrap percolation in metric networks

      Add to Reading List

      Source URL: www.weizmann.ac.il

      Language: English - Date: 2009-05-05 22:21:12
      58Static and Dynamic Properties of Small-world Connection Topologies Based on Transit-stub Networks

      Static and Dynamic Properties of Small-world Connection Topologies Based on Transit-stub Networks

      Add to Reading List

      Source URL: www.complex-systems.com

      Language: English - Date: 2012-09-20 14:36:39
      59

      PDF Document

      Add to Reading List

      Source URL: www.dmi.unict.it

      Language: English - Date: 2001-12-19 14:02:56
      60Automated Identification of Cryptographic Primitives in Binary Code with Data Flow Graph Isomorphism Pierre Lestringant AMOSSYS

      Automated Identification of Cryptographic Primitives in Binary Code with Data Flow Graph Isomorphism Pierre Lestringant AMOSSYS

      Add to Reading List

      Source URL: www.amossys.fr

      Language: English - Date: 2015-05-07 04:40:19